High-rate systematic recursive convolutional encoders: minimal trellis and code search
نویسندگان
چکیده
منابع مشابه
High-rate systematic recursive convolutional encoders: minimal trellis and code search
We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. Douillard and Berrou showed that, despite its complexity, the construction of high-rate turbo codes by means of high-rate constituent encoders is advantageous over the construction based on puncturing rate-1/2 constituent encoders. To reduce the decoding complexity of high-r...
متن کاملMinimal trellis construction from convolutional ring encoders
The paper addresses minimality of encoders for basic convolutional codes over Zpr by using a recently developed concept of row reducedness for polynomial matrices over Zpr . It is known in the literature that the McMillan degree of a basic encoder is an upper bound for the minimum number of trellis states, but a general expression is missing. This open problem is solved in this paper. An expand...
متن کاملMinimal Code(Error)-Trellis Module Construction for Rate-k/n Convolutional Codes: Extension of Yamada-Harashima-Miyakawa's Construction
Yamada, Harashima, and Miyakawa proposed to use a trellis constructed based on a syndrome former for the purpose of Viterbi decoding of rate-(n − 1)/n convolutional codes. In this paper, we extend their code-trellis construction to general rate-k/n convolutional codes. We show that the extended construction is equivalent to the one proposed by Sidorenko and Zyablov. Moreover, we show that the p...
متن کاملPunctured 8-PSK Turbo-TCM transmissions using recursive systematic convolutional GF(2N) encoders
A new Galois field GF ( 2 ) structure for designing recursive systematic convolutional (RSC) encoders is presented in this article. The proposed RSC encoders are used as components of a parallel-concatenated Turbo trellis coded modulation (TTCM) scheme. The GF ( 2 ) RSC encoders include a nonlinear function named leftcirculate (LCIRC), which is performing a left circulation over the N bits repr...
متن کاملA linear algebra approach to minimal convolutional encoders
This semitutorial paper starts with a review of some of Fomey’s contributions on the algebraic structure of convolutional encoders on which some new results on minimal convolutional encoders rest. An example is given of a basic convolutional encoding matrix whose number of abstract states is minimal over all equivalent encoding matrices. However, this encoding matrix can be realized with a mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2012
ISSN: 1687-6180
DOI: 10.1186/1687-6180-2012-243